An Implementation of Triangle-Triangle Intersection for Qualitative Spatial Reasoning
نویسندگان
چکیده
The intersection between 3D objects is ubiquitous in modeling. The objects are represented using the Boundary Representation (ANSI Brep) model in many applications such as CAD/CAM, collision detection, and spatial reasoning. Detection of possible intersection between objects can be based on the objects’ boundaries (approximate triangulations), computing triangle-triangle intersection. Usually there are separate algorithms for cross and coplanar intersections. The intersection detection is a byproduct of actual intersection computations. For qualitative spatial reasoning, intersection detection is sufficient, actual intersection is not necessary. Herein we present an implementation of a complete uniform integrated algorithm independent of cross and coplanar intersection. Additionally, we use barycentric coordinates for detecting and classifying intersections prior to computing precise 3D coordinates. This work is applicable to most region connection calculi, particularly VRCC-3D+, which uses intersection detection between 3D objects as well as their projections in 2D that are essential for occlusion detection.
منابع مشابه
A Fast Intersection Detection Algorithm for Qualitative Spatial Reasoning
In this paper we present a framework for determining the intersection of geometric objects based on the 9-Intersection model used in qualitative spatial reasoning. Triangle-triangle intersection is the computational basis for interaction between 2D/3D objects; hence a fast, robust intersection detection algorithm is beneficial. Additionally, we present efficient predicates for classification of...
متن کاملTriangle-Triangle Intersection Determination and Classification to Support Qualitative Spatial Reasoning
In CAD/CAM modeling, objects are represented using the Boundary Representation (ANSI Brep) model. Detection of possible intersection between objects can be based on the objects’ boundaries (i.e., triangulated surfaces), and computed using triangle-triangle intersection. Usually only a cross intersection algorithm is needed; however, it is beneficial to have a single robust and fast intersection...
متن کاملA Triangle-Triangle Intersection Algorithm
The intersection between 3D objects plays a prominent role in spatial reasoning, geometric modeling and computer vision. Detection of possible intersection between objects can be based on the objects’ triangulated boundaries, leading to computing triangle-triangle intersection. Traditionally there are separate algorithms for cross intersection and coplanar intersection. There is no single algor...
متن کاملA Generic Design for Implementing Intersection Between Triangles in Computer Vision and Spatial Reasoning
The intersection between 3D objects plays a prominent role in spatial reasoning, and computer vision. Detection of intersection between objects can be based on the triangulated boundaries of the objects, leading to computing triangle-triangle intersection. Traditionally there are separate algorithms for cross and coplanar intersection. For qualitative reasoning, intersection detection is suffic...
متن کاملAnalytic Visibility on the GPU
This paper presents a parallel, implementation-friendly analytic visibility method for triangular meshes. Together with an analytic filter convolution, it allows for a fully analytic solution to anti-aliased 3D mesh rendering on parallel hardware. Building on recent works in computational geometry, we present a new edge-triangle intersection algorithm and a novel method to complete the boundari...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014